Optimal Strategy Synthesis in Stochastic Müller Games
نویسنده
چکیده
The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph games: the qualitative problem asks for the set of states from which a player can win with probability 1 (almost-sure winning); the quantitative problem asks for the maximal probability of winning (optimal winning) from each state. We consider ω-regular winning conditions formalized as Müller winning conditions. We present optimal memory bounds for pure (deterministic) almost-sure winning and optimal winning strategies in stochastic graph games with Müller winning conditions. We also present improved memory bounds for randomized almost-sure winning and optimal strategies. Our results are relevant in synthesis of stochastic reactive processes. ⋆ This research was supported in part by the the AFOSR MURI grant F49620-00-1-0327, and the NSF grant CCR-0225610.
منابع مشابه
The complexity of stochastic Müller games
The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph...
متن کاملStrategy Synthesis for Stochastic Rabin Games with Discounted Reward
Stochastic games are often used to model reactive processes. We consider the problem of synthesizing an optimal almost-sure winning strategy in a two-player (namely a system and its environment) turnbased stochastic game with both a qualitative objective as a Rabin winning condition, and a quantitative objective as a discounted reward. Optimality is considered only over the almost-sure winning ...
متن کاملPRISM-Games 2.0: A Tool for Multi-objective Strategy Synthesis for Stochastic Games
We present a new release of PRISM-games, a tool for verification and strategy synthesis for stochastic games. PRISM-games 2.0 significantly extends its functionality by supporting, for the first time: (i) long-run average (mean-payoff) and ratio reward objectives, e.g., to express energy consumption per time unit; (ii) strategy synthesis and Pareto set computation for multi-objective properties...
متن کاملStrategy Synthesis for Stochastic Games with Multiple Long-Run Objectives
We consider turn-based stochastic games whose winning conditions are conjunctions of satisfaction objectives for long-run average rewards, and address the problem of finding a strategy that almost surely maintains the averages above a given multi-dimensional threshold vector. We show that strategies constructed from Pareto set approximations of expected energy objectives are ε-optimal for the c...
متن کاملOptimal production strategy of bimetallic deposits under technical and economic uncertainties using stochastic chance-constrained programming
In order to catch up with reality, all the macro-decisions related to long-term mining production planning must be made simultaneously and under uncertain conditions of determinant parameters. By taking advantage of the chance-constrained programming, this paper presents a stochastic model to create an optimal strategy for producing bimetallic deposit open-pit mines under certain and uncertain ...
متن کامل